package database;

public class BinarySearchTreeEntry<K, V> implements DictionaryEntry<K, V> {
	
	K key;
	V value;
	BinarySearchTreeEntry<K, V> rTree;
	BinarySearchTreeEntry<K, V> lTree;
	
	
	public BinarySearchTreeEntry(K ikey, V ival) {
		key = ikey;
		value = ival;
	}
		
	public K getKey() {
		return key;
	}

	public V getValue() {
		return value;
	}
	
	public void setValue(V ival){
		value = ival;
	}
	
	public void setLeftTree(BinarySearchTreeEntry<K, V> left) {
		lTree = left;
	}
	
	public void setRightTree(BinarySearchTreeEntry<K, V> right) {
		rTree = right;
	}
	
	public BinarySearchTreeEntry<K, V> getRightTree (){
		return rTree;
	}
	
	public BinarySearchTreeEntry<K, V> getLeftTree (){
		return lTree;
	}

}
